A Comparative Study of the Application of Different Learning Techniques to Natural Language Interfaces

In this paper we present first results from a comparative study. Its aim is to test the feasibility of different inductive learning techniques to perform the automatic acquisition of linguistic knowledge within a natural language database interface. In our interface architecture the machine learning module replaces an elaborate semantic analysis component. The learning module learns the correct mapping of a user's input to the corresponding database command based on a collection of past input data. We use an existing interface to a production planning and control system as evaluation and compare the results achieved by different instance-based and model-based learning algorithms.Comment: 10 pages, to appear CoNLL9

Checking Consistency of Database Constraints

This paper addresses the problem of consistency of a set of integrity constraints itself, independent from any state. It is pointed out that database constraints have not only to be consistent, but in addition to be finitely satisfiable. This stronger property reflects that the constraints have to admit a finite set of (stored as well as derivable) facts. As opposed to consistency, being undecidable, finite satisfiability is semidecidable. For efficiency purposes we investigate methods that check both finite satisfiability as well as unsatisfiability . Two different methods are proposed which extend two alternative approaches to refutation

Controllability of sequential machines

A sequential machine is said to be k-controllable if there exists a minimum integer k such that every state transition can be achieved by an input sequence of length k. In this paper properties of controllable sequential machines are discussed. The main results are as follows: (1) An efficient procedure for controllability test is given. (2) It is shown that every uncontrollable strongly connected machine has an autonomous component machine. (3) The upper bound of k in a controllable machine containing a loop of length l is given. (4) The upper and lower bounds of k in k-controllable machines are shown. (5) It is shown that any sequential machine can be realized by a controllable or uncontrollable machine

ジュンジョ カイロ ゲンゴ オヨビ カンレン シタ ケイ ノ イクツカ ノ クラス ニツイテ

京都大学0048新制・課程博士工学博士甲第1024号工博第226号新制||工||167(附属図書館)2626UT51-46-A540京都大学大学院工学研究科電子工学専攻(主査)教授 前田 憲一, 教授 清野 武, 教授 坂井 利之学位規則第5条第1項該当Kyoto UniversityDA